(De)Composition of Situation Calculus Theories
نویسنده
چکیده
We show that designing large situation calculus theories can be simplified by using object-oriented techniques and tools together with established solutions to the frame problem. Situation calculus (McCarthy & Hayes 1969) is one of the leading logical representations for action and change, but large situation calculus theories are not easy to design and maintain, nor are they flexible for extension or reuse. However, we wish to use it to represent large, complex domains. To address this problem, we apply our proposed methodology to situation calculus theories and analyze the composition of theories in this light. The object-oriented tools that we use do not change the semantics of situation calculus, so all the original situation calculus results apply in our setting and vice versa. We get two additional results from this approach. First, we offer a new treatment of loosely interacting agents that uses situation calculus without abandoning the result formalism. This treatment allows a theory-builder to construct a theory without considering its potential inclusion in a multiple-agents setup. Second, theories that we build in this way admit specialized reasoning algorithms.
منابع مشابه
Abstraction in Situation Calculus Action Theories
ion in Situation Calculus Action Theories Bita Banihashemi York University Toronto, Canada [email protected] Giuseppe De Giacomo Sapienza Università di Roma Roma, Italy [email protected] Yves Lespérance York University Toronto, Canada [email protected]
متن کاملOn the Undecidability of the Situation Calculus Extended with Description Logic Ontologies
In this paper we investigate situation calculus action theories extended with ontologies, expressed as description logics TBoxes that act as state constraints. We show that this combination, while natural and desirable, is particularly problematic: it leads to undecidability of the simplest form of reasoning, namely satisfiability, even for the simplest kinds of description logics and the simpl...
متن کاملBounded Situation Calculus Action Theories and Decidable Verification
We define a notion of bounded action theory in the situation calculus, where the theory entails that in all situations, the number of ground fluent atoms is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We argue that such theories are fairly common in applications, either because facts do not persist indefinitely or because one eventually ...
متن کاملBounded Epistemic Situation Calculus Theories
We define the class of e-bounded theories in the epistemic situation calculus, where the number of fluent atoms that the agent thinks may be true is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We show that for them verification of an expressive class of first-order μ-calculus temporal epistemic properties is decidable. We also show that ...
متن کاملOn First-Order μ-Calculus over Situation Calculus Action Theories
In this paper we study verification of situation calculus action theories against first-order μ-calculus with quantification across situations. Specifically, we consider μLa and μLp, the two variants of μ-calculus introduced in the literature for verification of data-aware processes. The former requires that quantification ranges over objects in the current active domain, while the latter addit...
متن کامل